On a Problem of Arnold: the Average Multiplicative Order of a given Integer Pär Kurlberg and Carl Pomerance
نویسندگان
چکیده
For g, n coprime integers, let `g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of `g(n) as n ≤ x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptotics of the average of `g(p) as p ≤ x ranges over primes.
منابع مشابه
On a Problem of Arnold: the Average Multiplicative Order of a given Integer
For g, n coprime integers, let `g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of `g(n) as n ≤ x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptot...
متن کاملOn the Period of the Linear Congruential and Power Generators Pär Kurlberg and Carl Pomerance
This sequence was first considered as a pseudorandom number generator by D. H. Lehmer. For the power generator we are given integers e, n > 1 and a seed u0 > 1, and we compute the sequence ui+1 = u e i (mod n) so that ui = u ei 0 (mod n). A popular case is e = 2, which is called the Blum–Blum–Shub (BBS) generator. Both of these generators are periodic sequences, and it is of interest to compute...
متن کاملThe average order of elements in the multiplicative group of a finite field
For any positive integer, we investigate the average order of elements in the multiplicative group of a finite field Fpk , where p is prime. Luca worked out the case k = 1 and we extend his results to the case k = 2 and sketch the outline to approach the general case where k is arbitrary but fixed. We show that the mean of the average order function for p 6 x is asymptotically Ckx for a certain...
متن کاملOn Sets of Integers Which Are Both Sum-free and Product-free
We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 2 and that this is best possible. Further, we also find the maximal order for the density of such sets that are also periodic modulo some positive integer.
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کامل